Tootfinder

Can We Help You?
Great Australian Pods Podcast Directory: #GreatAusPods

Can We Help You? | Great Australian Pods Podcast Directory
Podcast: Can We Help You? Hosts: Sacha Barbour Gatt and Jaxson McLennan Category: Comedy Sub-Category: Comedy Interviews & Chats, Self-Improvement & Advice First Episode: 2021 Sach and Jax answer life’…

Good poem for our age. Answer me this, though: guy's been dead for almost 400 years; why is there a 'follow' button?
No Man Is an Island by John Donne - Famous poems, famous poets. - All Poetry
https://allpoetry.com/No-man-is-an-island

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
https://arxiv.org/abs/2402.15348

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs $(s_1,t_1),(s_2,t_2),\ldots,(s_k,t_k)$. The task is to connect as many terminal pairs as possible by pairwise vertex-disjoint paths such that each path is a shortest path between the respective terminals. Our work is anchored in the recent breakthrough by Lochet [SODA '21], which demonstrate…

Baseball has an injury problem with plenty of questions and no real answers
#MLB #Baseball #SBNation

Not me reading the 500-comment neighborhood Facebook thread about whether it is a violation of sanctified property rights when a neighbor puts (bagged) dog poop in your curb-accessible bin
(Wow what a lot of displaced anger...) #WestSeattle

Huw Edwards, the BBC news anchor who has been off air since July 2023 after reports that he paid a young person for explicit images, resigns on "medical advice" (Ian Youngs/BBC)
https://www.bbc.com/news/entertainment-arts-68873266

Huw Edwards leaves BBC on medical advice
The presenter has been off air for months after reports he paid a young person for explicit photos.

Report from the Workshop on Xenon Detector $0\nu\beta\beta$ Searches: Steps Towards the Kilotonne Scale
A. Anker, A. Avasthi, M. Brodeur, T. Brunner, N. K. Byrnes, N. R. Catarineu, A. Cottle, P. Englezos, W. Fairbank, D. Gonz\'alez D\'iaz, R. Guenette, S. J. Haselschwardt, S. Hedges, M. Heffner, J. D. Holt, A. Jamil, B. J. P. Jones, N. Kawada, S. Leardini, B. G. Lenardo, A. Marc, J. Masbou, K. Mistry, B. Mong, B. Monreal, D. C. Moore, D. R. Nygren, I. Olcina, J. L. Orrell, A. P…

Report from the Workshop on Xenon Detector $0νββ$ Searches: Steps Towards the Kilotonne Scale
These proceedings summarize the program and discussions of the ``Workshop on Xenon Detector $0νββ$ Searches: Steps Towards the Kilotonne Scale'' held on October 25-27 2023 at SLAC National Accelerator Laboratory. This workshop brought together experts from the communities of neutrinoless double-beta decay and dark matter detection, to discuss paths forward for the realization of monolithic experiments with xenon approaching the kilotonne scale.

I think I am too stupid to work in academia. When I ask a simple question to my students, half of them would simply ignore me, assuming that it cannot be I ask a simple question. Then they come with a stream of words that answers the question they would have asked, which confuses me further.
Really folks, I am a simple man. I ask simple questions. Answer them pls.
This has been frustrating me so much lately, that I started to consider changing career paths ... getting too old to be patient?

The EU Parliament approves the AI Act, voting 523 in favor and 46 against, despite competition fears; the Act, born in 2021, puts AI tech into risk categories (CNBC)
https://www.cnbc.com/2024/03/13/european-lawmakers-endorse-wo…

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
https://arxiv.org/abs/2402.15348

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs $(s_1,t_1),(s_2,t_2),\ldots,(s_k,t_k)$. The task is to connect as many terminal pairs as possible by pairwise vertex-disjoint paths such that each path is a shortest path between the respective terminals. Our work is anchored in the recent breakthrough by Lochet [SODA '21], which demonstrate…